Tuple switching network - When slower may be better

نویسندگان

  • Justin Y. Shi
  • Moussa Taifi
  • Abdallah Khreishah
  • Jie Wu
چکیده

This paper reports an application dependent network design for extreme scale high performance computing (HPC) applications. Traditional scalable network designs focus on fast point-to-point transmission of generic data packets. The proposed network focuses on the sustainability of high performance computing applications by statistical multiplexing of semantic data objects. For HPC applications using data-driven parallel processing, a tuple is a semantic object. We report the design and implementation of a tuple switching network for data parallel HPC applications in order to gain performance and reliability at the same time when adding computing and communication resources. We describe a sustainability model and a simple computational experiment to demonstrate extreme scale application’s sustainability with decreasing system mean time between failures (MTBF). Assuming three times slowdown of statistical multiplexing and 35% time loss per checkpoint, a two-tier tuple switching framework would produce sustained performance and energy savings for extreme scale HPC application using more than 1024 processors or less than 6 hour MTBF. Higher processor counts or higher checkpoint overheads accelerate the benefits.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transmission switching cost modeling and determination candidate Lines for participation in joint energy and reserve markets

There is a great resolution calling for smart grids in recent years. Introduction of new technologies, that make the network flexible and controllable, is a main part of smart grid concept and a key factor to its success. Transmission network as a part of system network has drawn less attention. Transmission switching as a transmission service can release us from load shedding and remove the co...

متن کامل

k-TUPLE DOMATIC IN GRAPHS

For every positive integer k, a set S of vertices in a graph G = (V;E) is a k- tuple dominating set of G if every vertex of V -S is adjacent to at least k vertices and every vertex of S is adjacent to at least k - 1 vertices in S. The minimum cardinality of a k-tuple dominating set of G is the k-tuple domination number of G. When k = 1, a k-tuple domination number is the well-studied domination...

متن کامل

Déjà Vu Switching for Multiplane NoCs

In chip-multiprocessors (CMPs) the network-onchip (NoC) carries cache coherence and data messages. These messages may be classified into critical and non-critical messages. Hence, instead of having one interconnect plane to serve all traffic, power can be saved if the NoC is split into two planes: a fast plane dedicated to the critical messages and a slower, more power-efficient plane dedicated...

متن کامل

Better Algorithms for Hybrid Circuit and Packet Switching in Data Centers

Hybrid circuit and packet switching for data center networking (DCN) has received considerable research attention recently. A hybrid-switched DCN employs a much faster circuit switch that is reconfigurable with a nontrivial cost, and a much slower packet switch that is reconfigurable with no cost, to interconnect its racks of servers. The research problem is, given a traffic demand matrix (betw...

متن کامل

Sessile and Pendant Micro-Liter Drops Evaporate at Different Rates: An Experimental Approach

Evaporation of micro-liter drops from solid surfaces at room condition is mainly governed by diffusion. Therefore, there should be no difference between evaporation rate of sessile and pendant drops. However, some studies indicate a difference and explain the difference using buoyancy. The objective here is to reconcile the inconsistency in the literature. For that, first, by comparing two iden...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 72  شماره 

صفحات  -

تاریخ انتشار 2012